Complex Epistemic Modalities in the Situation Calculus
نویسندگان
چکیده
We develop a formal account of complex group-level epistemic modalities in the situation calculus, with a particular focus on reasoning about common knowledge. Expressions involving common knowledge cannot be handled by standard regression techniques and are thus difficult to reason about effectively. Taking our cue from recent promising work in dynamic epistemic logic, we overcome this limitation by increasing the expressive power of the epistemic language. The syntax of first-order dynamic logic is used to form complex epistemic modalities from the individual-level knowledge operators. Common knowledge is a special case of this syntax, using the unbounded iteration operator. We develop a regression rule for these complex modalities and demonstrate its use to reason about common knowledge in an example domain. The result is a rich multi-agent theory of knowledge and action in which complex group-level epistemic modalities are amenable to effective automated reasoning.
منابع مشابه
A Substructural Epistemic Resource Logic ( Extended Version ) 17 October , 2016 Didier Galmiche Pierre Kimmel
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...
متن کاملA Substructural Epistemic Resource Logic and Its Use in Systems Security Modelling
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on the agent’s local resource. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect ...
متن کاملA Substructural Epistemic Resource Logic
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...
متن کاملBounded Epistemic Situation Calculus Theories
We define the class of e-bounded theories in the epistemic situation calculus, where the number of fluent atoms that the agent thinks may be true is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We show that for them verification of an expressive class of first-order μ-calculus temporal epistemic properties is decidable. We also show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008